Perfect 2‐colorings of Hamming graphs
نویسندگان
چکیده
We consider the problem of existence perfect 2-colorings (equitable 2-partitions) Hamming graphs with given parameters. start conditions on parameters and colorings that are necessary for their existence. Next we observe known constructions propose some new ones giving At last, deduce which covered by these give tables admissible in H ( n , q ) small q. Using connection colorings, construct an orthogonal array OA(2048, 7, 4, 5).
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملTernary Hamming and binary perfect covering codes
Given 1 1n € Z, the n-cube Q, is the graph with vertex set V : {0, l}' and ed"geset n:VT:orfi, where f' : {(r,w) e V xV: (u _ w)i:1if and only if j: i,(j:0,.'. ,n-l)), for i:0,... ,n-1. The edges of/t aresaidtohave (ortolie along) the directioni,for i 0,.. . ,n-!.Given a graph G, we say that S gVG) is a perfect dom'inating sei (or PDS) of G if every u € V(G) \ S is neighbor of exactly one verte...
متن کاملCharacterizing subgraphs of Hamming graphs
Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E(G) fulfilling the following two conditions: (i) incident edges receive ...
متن کاملTree-like partial Hamming graphs
Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227–240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2021
ISSN: ['1520-6610', '1063-8539']
DOI: https://doi.org/10.1002/jcd.21771